A -calculus a La De Bruijn with Explicit Substitutions 7th International Conference on Programming Languages: Implementations, Logics and Programs, Plilp95, Lncs 982, Pages 45-62
نویسنده
چکیده
The aim of this paper is to present the s-calculus which is a very simple-calculus with explicit substitutions and to prove its connuence on closed terms and the preservation of strong normalisation of-terms. We shall prove strong normalisation of the corresponding calculus of substitution by translating it into the-calculus ACCL91], and therefore the relation between both calculi will be made explicit. The connuence of the s-calculus is obtained by the \interpretation method" ((Har89], CHL92]). The proof of the preservation of normalisation follows the lines of an analogous result for the-calculus (cf. BBLRD95]). The relation between s and is also studied.
منابع مشابه
On Explicit Substitutions and Names
machines and sharing.Our presentation of a explicit substitution cal-culus has been driven by the correspondence withthe semantics. Of the calculi discussed above, theoriginal -calculus of Abadi et al. [1] is the onlyone with a closer correspondence to a categoricalsemantics. We see our calculus as a direct improve-ment of theirs. Moreover, in earlier work [14] Ritte...
متن کاملOn Explicit Substitutions and Names ( Extended
Calculi with explicit substitutions have found widespread acceptance as a basis for abstract machines for functional languages. In this paper we investigate the relations between variants with de Bruijn-numbers, with variable names, with reduction based on raw expressions and calculi with equational judgements. We show the equivalence between these variants, which is crucial in establishing the...
متن کاملSUBSEXPL: a tool for simulating and comparing explicit substitutions calculi
We present the system SUBSEXPL used for simulating and comparing explicit substitutions calculi. The system allows the manipulation of expressions of the λ-calculus and of three different styles of explicit substitutions: the λσ, the λse and the suspension calculus. Implementations of the η-reduction are provided for each calculi. Other explicit substitutions calculi can be incorporated into th...
متن کاملBridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi
Calculi of explicit substitutions have almost always been presented using de Bruijn indices with the aim of avoiding α-conversion and being as close to machines as possible. De Bruijn indices however, though very suitable for the machine, are difficult to human users. This is the reason for a renewed interest in systems of explicit substitutions using variable names. We believe that the study o...
متن کاملA Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to understand and explain properties of these calculi and to compare the different styles of making explicit the substitution operation in implementations of the λ-calculus in de Bruijn notation. The system was developed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995